Integrating Structural Joins into a Tuple-Based XPath Algebra
نویسنده
چکیده
Over the recent years, very little effort has been made to give XPath a proper algebraic treatment. The only laudable exception is the Natix Algebra (NAL) which defines the translation of XPath queries into algebraic expressions in a concise way, thereby enabling algebraic optimizations. However, NAL does not capture various promising core XML query evaluation algorithms like, for example, the Holistic Twig Join. By integrating a logical structural join operator, we enable NAL to be compiled into a physical algebra, containing exactly those missing physical operators. We will provide several important query unnesting rules and demonstrate the effectivity of our approach by an implementation in the XML Transaction Coordinator (XTC)—our prototype of a native XML database system.
منابع مشابه
A Two-Step Approach for Tree-structured XPath Query Reduction
XML data consists of a very flexible tree-structure which makes it difficult to support the storing and retrieving of XML data. The node numbering scheme is one of the most popular approaches to store XML in relational databases. Together with the node numbering storage scheme, structural joins can be used to efficiently process the hierarchical relationships in XML. However, in order to proces...
متن کاملImproving the Efficiency of XPath Execution on Relational Systems
This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern SQL query processors, exploits XML schema information and has low implementation complexity. The method is based on the splitting of XPath expressions into Primary Path Fragments (PPFs) and their subsequent combination ...
متن کاملNovel Opportunities for Tuple-based Coordination: XPath, the Blockchain, and Stream Processing
The increasing maturity of some well-established technologies – such as XPath – along with the sharp rise of brand-new ones – i.e. the blockchain – presents new opportunities to researchers in the field of multi-agent coordination. In this position paper we briefly discuss a few technologies which, once suitably interpreted and integrated, have the potential to impact the very roots of tuple-ba...
متن کاملA Hybrid Approach for General XML Query Processing
The state-of-the-art XML twig pattern query processing algorithms focus on matching a single twig pattern to a document. However, many practical queries are modeled by multiple twig patterns with joins to link them. The output of twig pattern matching is tuples of labels, while the joins between twig patterns are based on values. The inefficiency of integrating label-based structural joins in t...
متن کاملComplex Object Joins in a Distributed Database
In non-standard database systems performance tends to be critical. To obtain the required response times for processing complex objects, parallelism needs to be exploited and suitable storage structure for complex objects have to be used. In this paper we use an hierarchical complex object model with object references. The join operations for these complex objects, called tuple-objects, are cat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007